COMMENT ⊗   VALID 00003 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Brudno
C00007 00003	Public policy references
C00008 ENDMK
C⊗;
Brudno

Bruner, J.S., Goodnow, J.J. and  Austin, C.A. (1956) A Study of Thinking.
	New York: John Willy.

Davis, M. and Putnam, H. (1960) A Computing Procedure for Quantification
	Theory. J. ACM, 7, 201.

%3Frey, Peter W.%1 ed. (1977) %2Chess Skill in Man and Machine%1,
Springer-Verlag, New York.

Gelernter, H.(1959) Realization of a Geometry Theorem Proving Machine. Proc. 
	ICIP. Paris: UNESCO House.

Greenblatt,R.D., Eastlake, D.E. and Crocker, S.D. (1967) The Greenblatt
	Chess Program. Proc. FJCC. Washington: Thompson Book Co.

Hart, T.P. and Edwards, D.dJ. (1961) The Tree Prune (TP) Algorithm.
	M.I.T. AI Project: Memo No. 30.

Hewitt, Carl (1967) Description and Theoretical Analysis (using Schemas)
	of Planner: A Language for Proving Theorems and Manipulating
	Models in a Robot. Ph.D. Thesis, Massachusetts Institute of
	Technology.

%3McCarthy, John%1 (1963) "A Basis for a Mathematical Theory of Computation", in
P. Braffort and D. Hirschberg (eds.), %2Computer Programming and Formal Systems%1,
 pp. 33-70.  North-Holland Publishing Company, Amsterdam.

%3McCarthy, John%1 (1960) Programs with Common Sense. %2Mechanisation of Thought
	Processes, Volume I%1.  London:HMSO.

%3McCarthy, J. and Hayes, P.J.%1 (1969) Some Philosophical Problems from
the Standpoint of Artificial Intelligence. %2Machine Intelligence 4%1,
pp. 463-502 (eds Meltzer, B. and Michie, D.). Edinburgh: Edinburgh
University Press.

Newell

%3Nilsson, N.J.%1 (1971) %2Problem-Solving Methods in Artificial Intelligence.%1
New York: McGraw-Hill.

	MITRE Corporation.

Russell, S.R. (1963) Improvements in LISP Debugging. Stanford Artificial
	Intelligence Project: Memo No. 10.

Russell, R. (1964) Kalah - The Game and the Program. Stanford Artificial
	Intelligence Project: Memo No. 22.

Russell, R. (1964) Improvements to the Kalah Program. Stanford Artificial
	Intelligence Project: Memo No. 23.

Russell, R. (19  )  Personal Communication.

Ryder, J.L. (1971) Heuristic Analysis of Large Trees as Generated in the
	Game of Go. Ph.D. Thesis, Stanford University.

Samuel, A.L.

Shannon, C. (1950) Programming a Digital Computer for Playing Chess.
	Philosophy Magazine. 41, 356-375.

Simon

Slagle, J.R., ed. (1971) Artificial Intelligence: The Heuristic Programming
	Approach. New York: McGraw-Hill.

%3Tennent, R.D.%1 (1976), The Denotational Semantics of Programming
Languages, %2Comm. ACM%1, (%319%1), August 1976, pp. 437-453.

Turing, A.M. (1950) Computing Machinery and Intelligence.  Mind. 59, 433-
	460.

I need a xerox of the following article obtainable in the math library.
The full name of the journal is Mathematics of Computation.
J. Brillhart, "Note on representing a prime as a sum of two squares","
%2Math. Comp.%1 v. 26, 1972 pp. 1011-1013.

Michael Willett, "Arithmetic in a Finite Field", %2Math. Comp.%1,
v. 35, 1980, pp. 1353-1359.

Allwood, Jens and Lars--Gunnar Andersson and \:Osten Dahl (1977):
Logic in Linguistics, Cambridge University Press
Public policy references

%3Simon, Julian L. (1980)%1: "Resources, Population, Environment: An
Oversupply of Bad News", %2Science%1, 27 June 1980, vol 208, No. 4451,
pp. 1431-1437.
compares false predictions of doom with statistics